Error-Correcting Codes and Minkowski’s Conjecture
نویسنده
چکیده
The goal of this paper is twofold. The main one is to survey the latest results on the perfect and quasi-perfect Lee error correcting codes. The other goal is to show that the area of Lee error correcting codes, like many ideas in mathematics, can trace its roots to the Phytagorean theorem a2+b2 = c2. Thus to show that the area of the perfect Lee error correcting codes is an integral part of mathematics. It turns out that Minkowski’s conjecture, which is an interface of number theory, approximation theory, geometry, linear algebra, and group theory is one of the milestones on the route to Lee codes.
منابع مشابه
One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملA new approach towards the Golomb-Welch conjecture
The Golomb-Welch conjecture deals with the existence of perfect eerror correcting Lee codes of word length n, PL(n, e) codes. Although there are many papers on the topic, the conjecture is still far from being solved. In this paper we initiate the study of an invariant connected to abelian groups that enables us to reformulate the conjecture, and then to prove the non-existence of linear PL(n, ...
متن کاملError-correcting codes from permutation groups
We replace the usual setting for error-correcting codes (i.e. vector spaces over finite fields) with that of permutation groups. We give an algorithm which uses a combinatorial structure which we call an uncovering-by-bases, related to covering designs, and construct some examples of these. We also analyse the complexity of the algorithm. We then formulate a conjecture about uncoverings-by-base...
متن کاملAn approach to fault detection and correction in design of systems using of Turbo codes
We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...
متن کاملOn Asymmetric Quantum MDS Codes
Assuming the validity of the MDS Conjecture, the weight distribution of all MDS codes is known. Using a recently-established characterization of asymmetric quantum error-correcting codes, linear MDS codes can be used to construct asymmetric quantum MDS codes with dz ≥ dx ≥ 2 for all possible values of length n for which linear MDS codes over Fq are known to exist.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011